The geometric mean decomposition
نویسندگان
چکیده
Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary matrices correspond to information lossless filters applied to transmitted and received signals that minimize the maximum error rate of the network. Another application is to the construction of test matrices with specified singular values. © 2004 Elsevier Inc. All rights reserved. AMS classification: 15A23; 65F25; 94A11; 60G35
منابع مشابه
Analysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملFinite-State Markov Chain Approximation for Geometric Mean of MIMO Eigenmodes
Time-varying nature of mobile fading channels can affect the design of wireless systems in many different aspects. This paper investigates the dynamic behavior of intrinsic spatial links in multiple-input multiple-output (MIMO) transceivers based on Geometric mean decomposition (GMD). In particular, we suggest using a finite-state Markov chain (FSMC) to model the fluctuations of both eigenmodes...
متن کاملLow Complexity Arithmetic Mean Decomposition Based Pre-coding for Mimo Systems and Its Fpga Implementation
This paper presents the novel approach for pre-coding in multiple input and multiple output systems using arithmetic mean decomposition. This proposed decomposition scheme has low complexity than popular geometric mean decomposition. CORDIC based Givens rotation is used for making the channel matrix as bi-diagonal matrix and then 2x2 singular value decomposition and 2x2 arithmetic mean decompos...
متن کاملImproved logarithmic-geometric mean inequality and its application
In this short note, we present a refinement of the logarithmic-geometric mean inequality. As an application of our result, we obtain an operator inequality associated with geometric and logarithmic means.
متن کاملInequalities between volume, center of mass, circumscribed radius, order, and mean curvature
By applying the spectral decomposition of a submanifold of a Euclidean space, we derive several sharp geometric inequalities which provide us some best possible relations between volume, center of mass, circumscribed radius, inscribed radius, order, and mean curvature of the submanifold. Several of our results sharpen some well-known geometric inequalities.
متن کامل